Path transferability of graphs with bounded minimum degree
نویسندگان
چکیده
منابع مشابه
Cliques in Graphs With Bounded Minimum Degree
Let fr(n, e) be the minimum number of r-cliques in graphs of order n and size e. Determining fr(n, e) has been a long-studied problem. The case r = 3, that is, counting triangles, has been studied by various people. Erdős [3], Lovász and Simonovits [7] studied the case when e = ( n 2 ) /2 + l with 0 < l n/2. Fisher [4] considered the situation when ( n 2 ) /2 e 2 ( n 2 ) /3, but it was not unti...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملPath Transferability of Planar Graphs
We regard a path as a train moving on a graph. A graph G is called n-transferable if any path of length n can be moved to any other such path by several steps. We will show that every planar graph with minimum degree at least three is at most 10 transferable.
متن کاملApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.05.015